<html><head>
<meta http-equiv="content-type" content="text/html; charset=ISO-8859-1">

<title>Problem F - Factoring Large Numbers</title>
</head><body bgcolor="white">

<font color="#0000ff"><h1>Problem F: Factoring Large Numbers</h1>
</font>

<p align="justify">
One of the central ideas behind much cryptography is that factoring
large numbers is computationally intensive.  In this context one might
use a 100 digit number that was a product of two 50 digit prime
numbers.  Even with the fastest projected computers this factorization
will take hundreds of years.

</p><p align="justify">
You don't have those computers available, but if you are clever you
can still factor fairly large numbers.

</p><p>

<font color="#0000ff"><h2>Input</h2></font>

</p><p align="justify">
The input will be a sequence of integer values, one per line,
terminated by a negative number.  The numbers will fit in gcc's
<code>long long int</code> datatype.
You may assume that there will be
at most one factor more than 1000000. 

<font color="#0000ff"><h2>Output</h2></font>

</p><p align="justify">
Each positive number from the input must be factored and all factors
(other than 1) printed out.  The factors must be printed in ascending
order with 4 leading spaces preceding a left justified number, and
followed by a single blank line.

<font color="#0000ff"><h2>Sample Input</h2></font>

</p><pre>90
1234567891
18991325453139
12745267386521023
-1
</pre>

<font color="#0000ff"><h2>Sample Output</h2></font>

<pre>    2
    3
    3
    5

    1234567891

    3
    3
    13
    179
    271
    1381
    2423

    30971
    411522630413
</pre>
<!--BR><HR>
<ADDRESS>
University of Porto ACM Programming Contest / Round 1 / 2002/05/22
</ADDRESS-->
</body></html>